Biplanes with flag-transitive automorphism groups of almost simple type, with classical socle

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Biplanes with flag-transitive automorphism groups of almost simple type, with alternating or sporadic socle

In this paper we prove that there cannot be a biplane admitting a primitive, flagtransitive automorphism group of almost simple type, with alternating or sporadic socle.

متن کامل

Flag-transitive point-primitive $(v,k,4)$ symmetric designs with exceptional socle of Lie type

Let $G$ be an automorphism group of a‎ ‎$2$-$(v,k,4)$ symmetric design $mathcal D$‎. ‎In this paper‎, ‎we‎ ‎prove that if $G$ is flag-transitive point-primitive‎, ‎then the‎ ‎socle of $G$ cannot be an exceptional group of Lie type‎.

متن کامل

Almost simple groups with Socle $G_2(q)$ acting on finite linear spaces

 After the classification of the flag-transitive linear spaces, the attention has been turned to line-transitive linear spaces. In this article, we present a partial classification of the finite linear spaces $mathcal S$ on which an almost simple group $G$ with the socle $G_2(q)$ acts line-transitively.

متن کامل

On groups with the same character degrees as almost simple groups with socle Mathieu groups

Let G be a finite group and cd(G) denote the set of complex irreducible character degrees of G. In this paper, we prove that if G is a finite group and H is an almost simple group whose socle is a Mathieu group such that cd(G) = cd(H), then there exists an abelian subgroup A of G such that G/A is isomorphic to H. In view of Huppert’s conjecture (2000), we also provide some examples to show that...

متن کامل

AUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS

An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebraic Combinatorics

سال: 2007

ISSN: 0925-9899,1572-9192

DOI: 10.1007/s10801-007-0070-7